Matching Subsequences in Trees
نویسندگان
چکیده
Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T . Here a path begins at the root and ends at a leaf. In this paper we propose this problem as a useful query primitive for XML data, and provide new algorithms improving the previously best known time and space bounds.
منابع مشابه
Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases
We introduce a new model of similarity of time sequences that captures the intuitive notion that two sequences should be considered similar if they have enough non-overlapping time-ordered pairs of subsequences thar are similar. The model allows the amplitude of one of the two sequences to be scaled by any suitable amount and its offset adjusted appropriately. Two subsequences are considered si...
متن کاملRepresenting Sequences in Description Logics Using Suffix Tree
This paper describes an approach for representing and manipulating sequences in description logics (DLs). The key idea is to represent sequences using suffix trees, then represent the resulting trees in a DL using traditional (tractable) concept and role operators. This approach supports the representation of a range of types of information about a sequence, such as the locations and numbers of...
متن کاملWaym Hissh and Daniel Kudenko
Representing and manipulating sequences in description logics (DLs) h as typically been achieved through the use of new sequence-specific operators or by relying on host-language functions. This paper shows that it is not necessary to add additional features to a DL to handle sequences, and instead describes an approach for dealing with sequences as first-class entities directly within a DL wit...
متن کاملRepresenting Sequences in Description Logics Using Suffix Trees
This paper describes an approach for representing and manipulating sequences in description logics (DLs). The key idea is to represent sequences using su x trees, then represent the resulting trees in a DL using traditional (tractable) concept and role operators. This approach supports the representation of a range of types of information about a sequence, such as the locations and numbers of o...
متن کاملSimilar Subsequence Search in Time Series Databases
Finding matching subsequences in time series data is an important problem. The classical approach to search for matching subsequences has been on the principle of exhaustive search, where all possible candidates are generated and evaluated or all the terms of the time series in a data base are examined. As a result most of the subsequence search algorithms are cubic in nature with few algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Discrete Algorithms
دوره 7 شماره
صفحات -
تاریخ انتشار 2006